Parallel Fission Bank Algorithms in Monte Carlo Criticality Calculations
نویسندگان
چکیده
منابع مشابه
Parallel Fission Bank Algorithms in Monte Carlo Criticality Calculations
In this work, we describe a new method for parallelizing the source iterations in a Monte Carlo criticality calculation. Instead of having one global fission bank that needs to be synchronized as is traditionally done, our method has each processor keep track of a local fission bank while still preserving reproducibility. In doing so, it is required to send only a limited set of fission bank si...
متن کاملParallel computing and Monte Carlo algorithms
We argue that Monte Carlo algorithms are ideally suited to parallel computing, and that “parallel Monte Carlo” should be more widely used. We consider a number of issues that arise, including dealing with slow or unreliable computers. We also discuss the possibilities of parallel Markov chain Monte Carlo. We illustrate our results with actual computer experiments.
متن کاملMonte Carlo calculations
A Monte Carlo simulation using the PRESTA version of the EGS4 code has been employed as an investigative tool to calculate the absorbed dose in water close to 192Ir wire implants. It has been shown that a treatment planning system, such as GE Target II, using the Sievert integral and the Meisberger polynomial is only able to reproduce the Monte Carlo results at radial distances of 1 mm and fart...
متن کاملLoad Balancing Of Parallel Monte Carlo Transport Calculations
The performance of parallel Monte Carlo transport calculations which use both spatial and particle parallelism is increased by dynamically assigning processors to the most worked domains. Since the particle work load varies over the course of the simulation, each cycle this algorithm determines if dynamic load balancing would speed up the calculation. If load balancing is required, a small numb...
متن کاملDynamic Load Balancing of Parallel Monte Carlo Transport Calculations
The performance of parallel Monte Carlo transport calculations which use both spatial and particle parallelism is increased by dynamically assigning processors to the most worked domains. Since he particle work load varies over the course of the simulation, this algorithm determines each cycle if dynamic load balancing would speed up the calculation. If load balancing is required, a small numbe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nuclear Science and Engineering
سال: 2012
ISSN: 0029-5639,1943-748X
DOI: 10.13182/nse10-98